Roomy: A New Approach to Parallel Disk-based Computation

نویسنده

  • Daniel Kunkle
چکیده

Disk-based computation provides a major new application of disks in addition to the three traditional uses: file systems, databases, and virtual memory. Our working group has coined the term disk-based computation to describe our five year effort for using parallel disks in scientific computations. Disk-based computation makes use of the many disks already available in a computational cluster. In doing so, we elevate the disk to a level normally reserved for RAM. This provides an application with several orders of magnitude more working space for the same price. These parallel disk-based methods are often based on lower level external memory algorithms, such as those surveyed by Vitter [54]. There are two fundamental challenges in implementing disk-based storage as an extension of main memory:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Algorithm for Workspace Generation of Delta Robot

Dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. Since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. Hence, importance of the efficiency of the algorithm and the CPU time of the workspace computatio...

متن کامل

Optimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm

Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...

متن کامل

Automatic implementation of a new recovery coefficient for Reliable contour milling

In contour milling, to render the machining process more automated with significant productivity without remaining material after machining, a new recovery coefficient was developed. The coefficient was inserted in the computation of contour parallel tool paths to fix the radial depth of cut in the way to ensure an optimized overlap area between the passes in the corners, without residuals. Thu...

متن کامل

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

Shortest Path Computation over Disk-Resident Large Graphs Based on Extended Bulk Synchronous Parallel Methods

The Single Source Shortest Path (SSSP) computation over large graphs has raised significant challenges to the memory capacity and processing efficiency. Utilizing disk-based parallel iterative computing is an economic solution. However, costs of disk I/O and communication affect the performance heavily. This paper proposes a state-transition model for SSSP and then designs two optimization stra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009